The global minima of the communicative energy of natural communication systems

Until recently, models of communication have explicitly or implicitly assumed that the goal of a communication system is just maximizing the information transfer between signals and `meanings'. Recently, it has been argued that a natural communication system not only has to maximize this quantity but also has to minimize the entropy of signals, which is a measure of the cognitive cost of using a word. The interplay between these two factors, i.e. maximization of the information transfer and minimization of the entropy, has been addressed previously using a Monte Carlo minimization procedure at zero temperature. Here we derive analytically the globally optimal communication systems that result from the interaction between these factors. We discuss the implications of our results for previous studies within this framework. In particular we prove that the emergence of Zipf's law using a Monte Carlo technique at zero temperature in previous studies indicates that the system had not reached the global optimum.Peer ReviewedPostprint (author's final draft

Synchronization in a ring of pulsating oscillators with bidirectional couplings

We study the dynamical behavior of an ensemble of oscillators interacting through short range bidirectional pulses. The geometry is 1D with periodic boundary conditions. Our interest is twofold. To explore the conditions required to reach fully synchronization and to invewstigate the time needed to get such state. We present both theoretical and numerical results.Comment: Revtex, 4 pages, 2 figures. To appear in Int. J. Bifurc. and Chao

Impact of community structure on information transfer

The observation that real complex networks have internal structure has important implication for dynamic processes occurring on such topologies. Here we investigate the impact of community structure on a model of information transfer able to deal with both search and congestion simultaneously. We show that networks with fuzzy community structure are more efficient in terms of packet delivery than those with pronounced community structure. We also propose an alternative packet routing algorithm which takes advantage of the knowledge of communities to improve information transfer and show that in the context of the model an intermediate level of community structure is optimal. Finally, we show that in a hierarchical network setting, providing knowledge of communities at the level of highest modularity will improve network capacity by the largest amount

La Cerca i la recerca de la complexitat a Catalunya: complexitat.CAT

Intentem, primer, donar una idea de què són els sistemes complexos, i repassem l'ac�� vitat de recerca duta en aquest àmbit a Catalunya. També comentem la creació de la xarxa complexitat.CAT i els seus objec�� us, així com els indicadors de producció cien�� fi ca de la comunitat local

La Cerca i la recerca de la complexitat a Catalunya: complexitat.CAT

Intentem, primer, donar una idea de què són els sistemes complexos, i repassem l'ac�� vitat de recerca duta en aquest àmbit a Catalunya. També comentem la creació de la xarxa complexitat.CAT i els seus objec�� us, així com els indicadors de producció cien�� fi ca de la comunitat local

Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization

Complex networks are essentially heterogeneous not only in the basic properties of the constituent nodes, such as their degree, but also in the effects that these have on the global dynamical properties of the network. Networks of coupled identical phase oscillators are good examples for analyzing these effects, since an overall synchronized state can be considered a reference state. A small variation of intrinsic node parameters may cause the system to move away from synchronization, and a new phase-locked stationary state can be achieved. We propose a measure of phase dispersion that quantifies the functional response of the system to a given local perturbation. As a particular implementation, we propose a variation of the standard Kuramoto model in which the nodes of a complex network interact with their neighboring nodes, by including a node-dependent frustration parameter. The final stationary phase-locked state now depends on the particular frustration parameter at each node and also on the network topology. We exploit this scenario by introducing individual frustration parameters and measuring what their effect on the whole network is, measured in terms of the phase dispersion, which depends only on the topology of the network and on the choice of the particular node that is perturbed. This enables us to define a characteristic of the node, its functionability, that can be computed analytically in terms of the network topology. Finally, we provide a thorough comparison with other centrality measures

Optimal cost tuning of frustration: Achieving desired states in the Kuramoto-Sakaguchi model

There are numerous examples of studied real-world systems that can be described as dynamical systems characterized by individual phases and coupled in a networklike structure. Within the framework of oscillatory models, much attention has been devoted to the Kuramoto model, which considers a collection of oscillators interacting through a sinus function of the phase differences. In this paper, we draw on an extension of the Kuramoto model, called the Kuramoto-Sakaguchi model, which adds a phase lag parameter to each node. We construct a general formalism that allows us to compute the set of lag parameters that may lead to any phase configuration within a linear approximation. In particular, we devote special attention to the cases of full synchronization and symmetric configurations. We show that the set of natural frequencies, phase lag parameters, and phases at the steady state is coupled by an equation and a continuous spectra of solutions is feasible. In order to quantify the system's strain to achieve that particular configuration, we define a cost function and compute the optimal set of parameters that minimizes it. Despite considering a linear approximation of the model, we show that the obtained tuned parameters for the case of full synchronization enhance frequency synchronization in the nonlinear model as well

Synchronization of mobile chaotic oscillator networks

We study synchronization of systems in which agents holding chaotic oscillators move in a two-dimensional plane and interact with nearby ones forming a time dependent network. Due to the uncertainty in observing other agents' states, we assume that the interaction contains a certain amount of noise that turns out to be relevant for chaotic dynamics. We find that a synchronization transition takes place by changing a control parameter. But this transition depends on the relative dynamic scale of motion and interaction. When the topology change is slow, we observe an intermittent switching between laminar and burst states close to the transition due to small noise. This novel type of synchronization transition and intermittency can happen even when complete synchronization is linearly stable in the absence of noise. We show that the linear stability of the synchronized state is not a sufficient condition for its stability due to strong fluctuations of the transverse Lyapunov exponent associated with a slow network topology change. Since this effect can be observed within the linearized dynamics, we can expect such an effect in the temporal networks with noisy chaotic oscillators, irrespective of the details of the oscillator dynamics. When the topology change is fast, a linearized approximation describes well the dynamics towards synchrony. These results imply that the fluctuations of the finite-time transverse Lyapunov exponent should also be taken into account to estimate synchronization of the mobile contact networks